Goal-Directed Methods for Fuzzy Logics
نویسندگان
چکیده
In this contribution we present uniform goal-directed rules for the implicational fragments of the three main formalizations of fuzzy logic; namely, Łukasiewicz logic Ł, Gödel logic G, and Product logic Π. We begin with a historical overview of the goal-directed methodology, focussing in particular on the pioneering work of Dov Gabbay, then proceed by recalling the fundamental systems of fuzzy logic, and developing corresponding goal-directed algorithms.
منابع مشابه
Lukasiewicz Logic: From Proof Systems To Logic Programming
We present logic programming style “goal-directed” proof methods for Lukasiewicz logic L that both have a logical interpretation, and provide a suitable basis for implementation. We introduce a basic version, similar to goal-directed calculi for other logics, and make refinements to improve efficiency and obtain termination. We then provide an algorithm for fuzzy logic programming in Rational P...
متن کاملDetermination of Suitable Areas for underground Dam Construction Using Boolean and Fuzzy Logics in Central Areas of Ardebil Province
In the arid and semi-arid area's rainfall have considerable changes in terms of time and amount that make the water resource management an important issue. In this research, using both Boolean and Fuzzy logic were zoned potentiality suitable areas for construction of underground dams. The study area is located in the central region of Ardabil province with 7461 km2 area and semi-arid climate. F...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملA Goal-Directed Calculus for Standard Conditional Logics
In this paper we focus on proof methods for conditional logics. We present US’, a goal-directed calculus for the basic normal conditional logic CK and its standard extensions ID, MP, and ID+MP. US’ is derived from some labelled sequent calculi, called SeqS’, and it is based on the notion of uniform proofs. We also introduce GoalDUCK, a simple implementation of US’ written in SICStus Prolog.
متن کامل